- discrete variable problem
- задача с дискретными переменными
Авиасловарь. М.А.Левин. 2004.
Авиасловарь. М.А.Левин. 2004.
Variable (mathematics) — In mathematics, a variable is a value that may change within the scope of a given problem or set of operations. In contrast, a constant is a value that remains unchanged, though often unknown or undetermined. The concepts of constants and… … Wikipedia
Discrete Fourier transform — Fourier transforms Continuous Fourier transform Fourier series Discrete Fourier transform Discrete time Fourier transform Related transforms In mathematics, the discrete Fourier transform (DFT) is a specific kind of discrete transform, used in… … Wikipedia
Discrete frequency — is defined as the frequency with which the samples of a discrete sinusoid occur. Just as in its continuous time counterpart (see frequency), the discrete time signal has a time axis, conventionally denoted by n . The time variable n , however,… … Wikipedia
Discrete choice analysis — is a statistical technique. In these models the dependent variable is a binary variable. Instances of discrete choice analysis are probit, logit and multinomial models. They are applied in econometrics, marketing research and transportation mode… … Wikipedia
Variable fractional delay filter — Introduction= One important advantage of the variable digital filter is that the frequency characteristics, including the magnitude response and the phase response are tunable without re implementation of the filter. Variable fractional delay… … Wikipedia
Knapsack problem — BKP redirects here. For other uses, see BKP (disambiguation). Example of a one dimensional (constraint) knapsack problem: which boxes should be chosen to maximize the amount of money while still keeping the overall weight under or equal to… … Wikipedia
Uniform distribution (discrete) — discrete uniform Probability mass function n = 5 where n = b − a + 1 Cumulative distribution function … Wikipedia
Clique problem — The brute force algorithm finds a 4 clique in this 7 vertex graph (the complement of the 7 vertex path graph) by systematically checking all C(7,4)=35 4 vertex subgraphs for completeness. In computer science, the clique problem refers to any of… … Wikipedia
Travelling salesman problem — The travelling salesman problem (TSP) is an NP hard problem in combinatorial optimization studied in operations research and theoretical computer science. Given a list of cities and their pairwise distances, the task is to find a shortest… … Wikipedia
Inverse problem — An inverse problem is a general framework that is used to convert observed measurements into information about a physical object or system that we are interested in. For example, if we have measurements of the Earth s gravity field, then we might … Wikipedia
Random variable — A random variable is a rigorously defined mathematical entity used mainly to describe chance and probability in a mathematical way. The structure of random variables was developed and formalized to simplify the analysis of games of chance,… … Wikipedia